Automatic Verification of Time Sensitive Cryptographic Protocols
نویسندگان
چکیده
We investigate the applicability of symbolic exploration to the automatic verification of secrecy and authentication properties for time sensitive cryptographic protocols. Our formal specifications are given in multiset rewriting over first order atomic formulas enriched with constraints so as to uniformly model fresh name generation and validity condition of time stamps. Our verification approach is based on data structures for symbolically representing sets of configurations of an arbitrary number of parallel protocol sessions. As a case study we discuss the verification of timed authentication for the Wide Mouth Frog protocol.
منابع مشابه
On formal and automatic security verification of WSN transport protocols
In this paper, we address the problem of formal and automated security verification ofWSN transport protocols that may perform cryptographic operations. The verification ofthis class of protocols is difficult because they typically consist of complex behavioral charac-teristics, such as real-time, probabilistic, and cryptographic operations. To solve this problem,we propose a pr...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملAutomatic Verification of Cryptographic Protocols in First-Order Logic
In this paper, a new first-order logical framework and method of formalizing and verifying cryptographic protocols is presented. From the point of view of an intruder, the protocol and abilities of the intruder are modeled in Horn clauses. Based on deductive reasoning method, secrecy of cryptographic protocols is verified automatically, and if the secrecy is violated, attack scenarios can be pr...
متن کاملA Logic for Automatic Verification of Cryptographic Protocols
this paper, a new first-order logical framework and method of formalizing and verifying cryptographic protocols is presented. From the point of view of an intruder, the protocol and abilities of the intruder are modeled in Horn clauses. Based on deductive reasoning method, secrecy of cryptographic protocols is verified automatically, and if the secrecy is violated, attack scenarios can be prese...
متن کاملFirst-order Verification of Cryptographic Protocols
We describe a verification method for cryptographic protocols, based on first-order invariants. For typical protocols, a suitable invariant can be generated mechanically from the program text, allowing safety properties to be proved by ordinary first-order reasoning. The method has been implemented in an automatic verifier, TAPS, that proves safety properties comparable to those in published Is...
متن کامل